On Finding the Rectangular Duals of Planar Triangular Graphs
نویسنده
چکیده
We present a new linear time algorithm for nding rectangular duals of planar triangular graphs. The algorithm is conceptually simpler than the previous known algorithm. The coordinates of the rectangular dual constructed by our algorithm are integers and have pure combinatorial meaning. This allows us to discuss the heuristics for minimizing the size of the rectangular duals.
منابع مشابه
A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings
A plus-contact representation of a planar graph G is called c-balanced if for every plus shape v, the number of other plus shapes incident to each arm of v is at most c∆+O(1), where ∆ is the maximum degree of G. Although small values of c have been achieved for a few subclasses of planar graphs (e.g., 2and 3-trees), it is unknown whether c-balanced representations with c < 1 exist for arbitrary...
متن کاملTwo Algorithms for Finding Rectangular Duals of Planar Graphs
1 I n t r o d u c t i o n The problem of drawing a graph on the plane has received increasing attention due to a large number of applications [3]. Examples include VLSI layout, algorithm animation, visual languages and CASE tools. Vertices are usually represented by points and edges by curves. In the design of floor planning of electronic chips and in architectural design, it is also common to ...
متن کاملپرش هیدرولیکی در مقطع مثلثی و مقایسه با مقطع مستطیلی
This paper presents the results of an analytical and experimental study on the characteristics of hydraulic jump in a triangular channel. The analytical consideration is based on the momentum conservation law for the upstream and downstream sections of the jump. The experiments were carried out in a triangular channel of glass side walls with the vertex angle of 94.4°. A wide range of discharge...
متن کاملThe Duals of Upward Planar Graphs on Cylinders
We consider directed planar graphs with an upward planar drawing on the rolling and standing cylinders. These classes extend the upward planar graphs in the plane. Here, we address the dual graphs. Our main result is a combinatorial characterization of these sets of upward planar graphs. It basically shows that the roles of the standing and the rolling cylinders are interchanged for their duals.
متن کاملEfficient Algorithms for Drawing Planar Graphs
This thesis presents efficient algorithms for drawing planar graphs. Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. In this thesis we study rectangular drawings, orthogonal drawings, convex drawings and our newly defined box-rectangular drawings. Rectangular drawings and box-rec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 22 شماره
صفحات -
تاریخ انتشار 1993